A New Point of NP-Hardness for 2-to-1 Label Cover
نویسندگان
چکیده
We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a ( 23 24 + )-satisfying assignment. ∗Department of Computer Science, University of Toronto. Funded by NSERC. †Department of Computer Science, Carnegie Mellon University. Supported by NSF grants CCF-0747250 and CCF-0915893, and by a Sloan fellowship. ‡Department of Computer Science, Carnegie Mellon University. ar X iv :1 20 4. 56 66 v1 [ cs .C C ] 2 5 A pr 2 01 2
منابع مشابه
$2^{(\log N)^{1/4-o(1)}}$ Hardness for Hypergraph Coloring
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2 1/8−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2 Ω( √ log log N) colors. Their result is obtained by ...
متن کاملHardness for Hypergraph Coloring
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(logN) 1/10−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22Ω( √ log logN) colors. Their result is obtain...
متن کامل2(logN) Hardness for Hypergraph Coloring
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(logN) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, Håstad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22 √ log logN) colors. Their result is obtained by compos...
متن کاملNew Hardness Results for Graph and Hypergraph Colorings
Finding a proper coloring of a t-colorable graph G with t colors is a classic NP-hard problem when t ≥ 3. In this work, we investigate the approximate coloring problem in which the objective is to find a proper c-coloring of G where c ≥ t. We show that for all t ≥ 3, it is NP-hard to find a c-coloring when c ≤ 2t− 2. In the regime where t is small, this improves, via a unified approach, the pre...
متن کاملOn the hardness of approximating label-cover
The LABEL-COVER problem, defined by S. Arora, L. Babai, J. Stern, Z. Sweedyk [Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 724–733], serves as a starting point for numerous hardness of approximation reductions. It is one of six ‘canonical’ approximation problems in the survey of Arora and Lund [Hardness of Approximations, in: Approximation Algorithms for NP-H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012